ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES
نویسندگان
چکیده
منابع مشابه
Index system and separability of constant weight Gray codes
1229 compression of files of information retrieval systems. With this application in mind, bounds on the average codelength of an alphabetical code were studied. The major results of this correspondence are as follows. 1) A necessary and sufficient condition for the existence of a 2) An upper bound for Lopt (the average codelength of the binary alphabetical code was given. optimal alphabetical ...
متن کاملOptimal Constant Weight Codes
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denot...
متن کاملConstant-Weight Array Codes
Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In this paper, we introduce constant-weight array codes (CWACs), which offer a tradeoff between the rate gain of general constant-weight codes and the low deco...
متن کاملTernary Constant Weight Codes
Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.
متن کاملUsing Genetic Algorithms to Design Constant Weight Codes
Genetic algorithms have been used successfully for solving di erent combinatorial optimization problems. We give here a new e cient application for the search of constant weight codes. The algorithm presented is intended to generate codes with the maximum number of codewords for a given length, constant weight and minimum Hamming distance. A comparison with the simulated annealing technique is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 2005
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089505002430